Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows
The Orienteering Problem with Time Windows (OPTW) is an optimisation NP-hard problem. This paper proposes a hybrid genetic algorithm (GAPR) for approximating a solution to the OPTW. Instead of the usual crossover we use a path relinking (PR) strategy as a form of intensification solution. This approach generates a new solution by exploring trajectories between two random solutions: genes not pr...
متن کاملGenetic Algorithm Solving the Orienteering Problem with Time Windows
Abstract. The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with a fixed limit on length or travel time, that maximises the cumulative score of the locations visited in the predefined time intervals. Th...
متن کاملGRASP with path relinking for the orienteering problem
In this paper, we address an optimization problem resulting from the combination of the wellknown traveling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sports, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travellin...
متن کاملAn Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty
In this paper, we introduce a model to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2014
ISSN: 0169-2968
DOI: 10.3233/fi-2014-1132